Chasing One's Tail: XPath Containment Under Cyclic DTDs

نویسندگان

  • Manizheh Montazerian
  • Peter T. Wood
چکیده

The problem of finding subclasses of XPath queries and document type definitions (DTDs) for which containment can be tested efficiently has been much studied. Along the way, a number of constraints inferred from DTDs have been used to characterise containment in terms of the chase procedure. However, previous attempts have resulted in procedures that are non-terminating for cyclic DTDs, even when the queries include only the child and descendant operators (i.e., no predicates or wildcards). In this paper, we introduce a rewriting of such XPath queries in the presence of cyclic (but simplified) DTDs, using an operator that generalises the child and descendant operators, and show that doing so allows us to produce a complete procedure for containment using the chase and previous classes of constraints. We also characterise a set of constraints that allows for a complete chase procedure for this fragment of XPath in the case of general, non-cyclic DTDs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

XPath Query Satisfiability and Containment under DTD Constraints

In this thesis, we consider the XML query language XPath, along with XML documents whose integrity constraints are presented in the form of document type definitions (DTDs). In particular, we study the problems of XPath satisfiability and XPath containment in the presence of DTDs. The motivation for studying XPath is that it is the main language for navigating in and extracting information from...

متن کامل

Containment for XPath Fragments under DTD Constraints

The containment and equivalence problems for various fragments of XPath have been studied by a number of authors. For some fragments , deciding containment (and even minimisation) has been shown to be in ptime, while for minor extensions containment has been shown to be conp-complete. When containment is with respect to trees satisfying a set of constraints (such as a schema or DTD), the proble...

متن کامل

Containment and Integrity Constraints for XPath Fragments

XPath is a W3C standard that plays a crucial role in several in uential query, transformation, and schema standards for XML. Motivated by the larger challenge of XML query optimization, we investigate the problem of containment of XPath expressions under integrity constraints that are in turn formulated with the help of XPath expressions. Our core formalism consists of a fragment of XPath that ...

متن کامل

XPath Containment in the Presence of Disjunction, DTDs, and Variables

XPath is a simple language for navigating an XML tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various fragments of XPath. In addition to the basic operations (child, descendant, filter, and wildcard), we consider disjunction, DTDs and variables. W.r.t. variables we study two semantics: (1) the value of variables is given b...

متن کامل

Validity of Positive XPath Queries with Wildcard in the Presence of DTDs

This paper discusses the validity problem for positive XPath queries with wildcard in the presence of DTDs. A given XPath query p is valid under a DTD D if, for every XML document T conforming to D, the answer to p on T is nonempty. The validity problem is one of the basic static analyses of queries, together with the satisfiability and the containment problems. Although the validity problem is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011